Fast Prediction of Deterministic Functions Using Sparse Grid Experimental Designs
نویسندگان
چکیده
منابع مشابه
Fast Deterministic Distributed Algorithms for Sparse Spanners
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanners of o(n2) edges, have a running time Ω(n ) for some constant > 0 depending on the stretch. Our deterministic distributed algorithms construct constant stretch spanners of o(n2) edges in o(n...
متن کاملFast, Deterministic and Sparse Dimensionality Reduction
We provide a deterministic construction of the sparse JohnsonLindenstrauss transform of Kane & Nelson (J.ACM 2014) which runs, under a mild restriction, in the time necessary to apply the sparse embedding matrix to the input vectors. Specifically, given a set of n vectors in R and target error ε, we give a deterministic algorithm to compute a {−1, 0, 1} embedding matrix of rank O((lnn)/ε) with ...
متن کاملAdaptive Sparse Grid Classification Using Grid Environments
Common techniques tackling the task of classification in data mining employ ansatz functions associated to training data points to fit the data as well as possible. Instead, the feature space can be discretized and ansatz functions centered on grid points can be used. This allows for classification algorithms scaling only linearly in the number of training data points, enabling to learn from da...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملDeterministic Length Reduction: Fast Convolution in Sparse Data and Applications
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the regular fast convolution of vectors V1, V2 whose sizes are N1, N2 respectively, takes O(N1 log N2) using FFT, the proposed algorithm performs the convolution in O(n1 log n1), where n1 is the number of non-zero values i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2014
ISSN: 0162-1459,1537-274X
DOI: 10.1080/01621459.2014.900250